Optimal Pooling Designs with Error Detection

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Pooling Designs with Error Detection

Consider a collection of objects, some of which may be ‘bad’, and a test which determines whether or not a given sub-collection contains no bad objects. The non-adaptive pooling (or group testing) problem involves identifying the bad objects using the least number of tests applied in parallel. The ‘hypergeometric’ case occurs when an upper bound on the number of bad objects is known a priori. H...

متن کامل

Error-Tolerant Pooling Designs with Inhibitors

Pooling designs are used in clone library screening to efficiently distinguish positive clones from negative clones. Mathematically, a pooling design is just a nonadaptive group testing scheme which has been extensively studied in the literature. In some applications, there is a third category of clones called "inhibitors" whose effect is to neutralize positives. Specifically, the presence of a...

متن کامل

New Construction of Error-Tolerant Pooling Designs

We present a new class of error-tolerant pooling designs by constructing d−disjunct matrices associated with subspaces of a finite vector space.

متن کامل

Decoding algorithms in pooling designs with inhibitors and error-tolerance

Pooling designs are used in DNA library screening to efficiently distinguish positive from negative clones, which is fundamental for studying gene functions and many other biological applications. One challenge is to design decoding algorithms for determining whether a clone is positive based on the test outcomes and a binary matrix representing the pools. This is more difficult in practice due...

متن کامل

Constructing error-correcting pooling designs with symplectic space

We construct a family of error-correcting pooling designs with the incidence matrix of two types of subspaces of symplectic spaces over finite fields. We show that the new construction gives better ratio of efficiency compared with previously known three constructions associated with subsets of a set, its analogue over a vector space, and the dual spaces of a symplectic space.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series A

سال: 1996

ISSN: 0097-3165

DOI: 10.1006/jcta.1996.0041